-
1 Stone theorem
Математика: теорема Стоуна -
2 Stone theorem
-
3 theorem
- theorem of total probability
- acoustical reciprocity theorem
- Ampere's circuital theorem
- average theorem
- Bayes theorem
- Birkhoff-von Neumann theorem
- Bloch theorem
- Brouwer fixed-point theorem
- Cayley theorem - Chinese residue theorem
- compensation theorem
- completeness theorem
- constant-flux-linkage theorem
- Coopmans theorem
- CPT-theorem
- Cramer theorem
- current sheet theorem
- Dilworth theorem
- divergence theorem
- Floquet theorem
- Foster's reactance theorem
- Fourier theorem
- fuzzy theorem
- fuzzy approximation theorem
- Gauss theorem
- Gauss-Markov theorem
- Gödel's theorem
- Gödel's incompleteness theorem
- Hecht-Nielsen theorem
- hierarchy theorem
- Kolmogorov theorem
- Kolmogorov-Arnold theorem
- limit theorem
- logic theorem
- Lüders-Pauli theorem
- Manley-Rowe theorem
- matching theorem
- McCulloh-Pitts theorem
- Mermin-Wagner theorem
- Nyquist's theorem
- Poincare-Birkhoff theorem
- Poynting's theorem
- reciprocity theorem
- Radon theorem
- Routh-Hurwitz theorem
- sampling theorem
- selection theorem
- semantic theorem
- Shannon theorem
- Slutsky's theorem
- Stokes theorem
- Stone theorem
- superposition theorem
- syntactical theorem
- Takens theorem
- Thevenin's theorem
- unicity theorem
- Weierstrass theorem
- Wiener-Khintchin theorem
- Zorn theorem
См. также в других словарях:
Erdős–Stone theorem — In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán s theorem to bound the number of edges in an H free graph for a non complete graph H . It is named after Paul Erdős and Arthur Stone, who proved it in… … Wikipedia
Banach–Stone theorem — In mathematics, the Banach–Stone theorem is a classical result in the theory of continuous functions on topological spaces, named after the mathematicians Stefan Banach and Marshall Stone.tatement of the theoremFor a topological space X , let C… … Wikipedia
STONE (M. H.) — STONE MARSHALL HARVEY (1903 1989) Après ses études à l’université Harvard, Marshall Harvey Stone enseigna dans diverses universités: Columbia (1925 1927), Yale (1931 1933), Harvard (1927 1931, puis 1933 1946) et Chicago (depuis 1944). Il fut élu… … Encyclopédie Universelle
Stone–von Neumann theorem — In mathematics and in theoretical physics, the Stone–von Neumann theorem is any one of a number of different formulations of the uniqueness of the canonical commutation relations between position and momentum operators. The name is for Marshall… … Wikipedia
Stone's representation theorem for Boolean algebras — In mathematics, Stone s representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a field of sets. The theorem is fundamental to the deeper understanding of Boolean algebra that emerged in the first half of… … Wikipedia
Stone duality — In mathematics, there is an ample supply of categorical dualities between certain categories of topological spaces and categories of partially ordered sets. Today, these dualities are usually collected under the label Stone duality, since they… … Wikipedia
Stone's theorem on one-parameter unitary groups — In mathematics, Stone s theorem on one parameter unitary groups is a basic theorem of functional analysis which establishes a one to one correspondence between self adjoint operators on a Hilbert space H and one parameter families of unitary… … Wikipedia
Stone–Weierstrass theorem — In mathematical analysis, the Weierstrass approximation theorem states that every continuous function defined on an interval [ a , b ] can be uniformly approximated as closely as desired by a polynomial function. Because polynomials are the… … Wikipedia
Stone–Čech compactification — In the mathematical discipline of general topology, Stone–Čech compactification is a technique for constructing a universal map from a topological space X to a compact Hausdorff space beta; X . The Stone–Čech compactification beta; X of a… … Wikipedia
Marshall Harvey Stone — Born April 8, 1903 New York City Died January 9, 1989 Madras Citizenship … Wikipedia
Turán's theorem — In graph theory, Turán s theorem is a result on the number of edges in a Kr+1 free graph. An n vertex graph that does not contain any (r + 1) vertex clique may be formed by partitioning the set of vertices into r parts of equal or… … Wikipedia
